Generalization of partitioned Runge–Kutta methods for adjoint systems

نویسندگان

چکیده

This study computes the gradient of a function numerical solutions ordinary differential equations (ODEs) with respect to initial condition. The adjoint method approximately by solving corresponding system numerically. In this context, Sanz-Serna [SIAM Rev., 58 (2016), pp. 3–33] showed that when value problem is solved Runge–Kutta (RK) method, can be exactly computed applying an appropriate RK system. Focusing on case where partitioned (PRK) paper presents which seen as generalization PRK methods, for gives exact gradient.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective order strong stability preserving RungeKutta methods

We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...

متن کامل

islanding detection methods for microgrids

امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...

15 صفحه اول

A Generalization Method of Partitioned Activation Function for Complex Number

A method to convert real number partitioned activation function into complex number one is provided. The method has 4em variations; 1 has potential to get holomorphic activation, 2 has potential to conserve complex angle, and the last 1 guarantees interaction between real and imaginary parts. The method has been applied to LReLU and SELU as examples. The complex number activation function is an...

متن کامل

Adjoint methods for car aerodynamics

The adjoint method has long been considered as the tool of choice for gradient-based optimisation in computational fluid dynamics (CFD). It is the independence of the computational cost from the number of design variables that makes it particularly attractive for problems with large design spaces. Originally developed by Lions and Pironneau in the 70’s, the adjoint method has evolved towards a ...

متن کامل

Revised methods for Adjoint Calculations

A common class of shielding problems involves the calculation of biological dose rates from large distributed sources at localised positions. A typical example is that of calculating the dose at points around a transport cask. Sophisticated variance reduction methods must be used in Monte Carlo calculations to sample from the important parts of the source and to propagate particles towards the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2021

ISSN: ['0377-0427', '1879-1778', '0771-050X']

DOI: https://doi.org/10.1016/j.cam.2020.113308